Correlation Analysis of Node and Edge Centrality Measures in Artificial Complex Networks
نویسندگان
چکیده
The importance of a node in social network is identified through set measures called centrality. Degree centrality, closeness betweenness centrality and clustering coefficient are the most frequently used metrics to compute Their computational complexity some cases makes unfeasible, when not practically impossible, their computations. For this reason we focused on two alternative measures, WERW-Kpath Game Thieves, which at same time highly descriptive computationally affordable. Our experiments show that strong correlation exists between Thieves classical measures. This may suggest possibility using them as useful more economic replacements
منابع مشابه
Temporal node centrality in complex networks.
Many networks are dynamic in that their topology changes rapidly--on the same time scale as the communications of interest between network nodes. Examples are the human contact networks involved in the transmission of disease, ad hoc radio networks between moving vehicles, and the transactions between principals in a market. While we have good models of static networks, so far these have been l...
متن کاملRange-limited Centrality Measures in Complex Networks
Here we present a range-limited approach to centrality measures in both nonweighted and weighted directed complex networks. We introduce an efficient method that generates for every node and every edge its betweenness centrality based on shortest paths of lengths not longer than ℓ=1,...,L in the case of nonweighted networks, and for weighted networks the corresponding quantities based on minimu...
متن کاملCentrality Measures in Networks
We show that although the prominent centrality measures in network analysis make use of different information about nodes’ positions, they all process that information in a very restrictive and identical way. They all spring from a common family that are characterized by the same axioms. In particular, they are all based on a additively separable and linear treatment of a statistic that capture...
متن کاملCorrelation and Regression Analysis for Node Betweenness Centrality
In this paper, we seek to find a computationally light centrality metric that could serve as an alternate for the computationally heavy betweenness centrality (BWC) metric. In this pursuit, in the first half of the paper, we evaluate the correlation coefficient between BWC and the other commonly used centrality metrics such as Degree Centrality (DEG), Closeness Centrality (CLC), Farness Central...
متن کاملCorrelation of Eigenvector Centrality to Other Centrality Measures: Random, Small-world and Real-world Networks
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality measures, including degree centrality, betweenness centrality, clustering coefficient centrality, closeness centrality, and farness centrality, of various types of network (random network, smallworld network, and real-world network). For each network, we compute those six centrality measures, from...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture notes in networks and systems
سال: 2021
ISSN: ['2367-3370', '2367-3389']
DOI: https://doi.org/10.1007/978-981-16-1781-2_78